A rational Arnoldi approach for ill-conditioned linear systems
نویسندگان
چکیده
For the solution of full-rank ill-posed linear systems a new approach based on the Arnoldi algorithm is presented. Working with regularized systems, the method theoretically reconstructs the true solution by means of the computation of a suitable function of matrix. In this sense the method can be referred to as an iterative refinement process. Numerical experiments arising from integral equations and interpolation theory are presented. Finally, the method is extended to work in connection with the standard Tikhonov regularization with a right hand side contaminated by noise.
منابع مشابه
ABS Solution of equations of second kind and application to the primal-dual interior point method for linear programming
Abstract We consider an application of the ABS procedure to the linear systems arising from the primal-dual interior point methods where Newton method is used to compute path to the solution. When approaching the solution the linear system, which has the form of normal equations of the second kind, becomes more and more ill conditioned. We show how the use of the Huang algorithm in the ABS cl...
متن کاملA Fast Algorithm for Solving Regularized Total Least Squares Problems
The total least squares (TLS) method is a successful approach for linear problems if both the system matrix and the right hand side are contaminated by some noise. For ill-posed TLS problems Renaut and Guo [SIAM J. Matrix Anal. Appl., 26 (2005), pp. 457 476] suggested an iterative method which is based on a sequence of linear eigenvalue problems. Here we analyze this method carefully, and we ac...
متن کاملComputing Matrix Symmetrizers, Part 2: new Methods using Eigendata and Linear Means; a Comparison∗
Over any field F every square matrix A can be factored into the product of two symmetric matrices as A = S1 ·S2 with Si = S i ∈ F and either factor can be chosen nonsingular, as was discovered by Frobenius in 1910. Frobenius’ symmetric matrix factorization has been lying almost dormant for a century. The first successful method for computing matrix symmetrizers, i.e., symmetric matrices S such ...
متن کاملTikhonov regularization via flexible Arnoldi reduction
Flexible GMRES, introduced by Saad, is a generalization of the standard GMRES method for the solution of large linear systems of equations. It is based on the flexible Arnoldi process for reducing a large square matrix to a small matrix. We describe how the flexible Arnoldi process can be applied to implement one-parameter and multi-parameter Tikhonov regularization of linear discrete ill-posed...
متن کاملExtrapolation techniques for ill-conditioned linear systems
In this paper, the regularized solutions of an ill{conditioned system of linear equations are computed for several values of the regularization parameter. Then, these solutions are extrapolated at = 0 by various vector rational extrapolations techniques built for that purpose. These techniques are justiied by an analysis of the regularized solutions based on the singular value decomposition and...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Computational Applied Mathematics
دوره 236 شماره
صفحات -
تاریخ انتشار 2012